Optimization problem - PDFSEARCH.IO - Document Search Engine

Optimization problem
Results: 1483

#	Item
791	PDF Document Add to Reading List Source URL: web.udl.es Language: English - Date: 2004-02-02 12:51:38 Applied mathematics George Dantzig Linear programming Mathematical economics John von Neumann Cutting-plane method Simplex algorithm Nonlinear programming Travelling salesman problem Mathematics Mathematical optimization Operations research
792	Lecture V §1. Joy Rides Page 1 Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-10-01 09:47:54 NP-complete problems Operations research Bin packing problem Mathematical optimization Greedy algorithm Minimum spanning tree Packing problem Dynamic programming Approximation algorithm Mathematics Theoretical computer science Applied mathematics
793	On a Global Optimization Technique for Solving a Nonlinear Hyperboloid Least Squares Problem Leticia Velázquez1, Miguel Argáez1, Brenda Bueno2, Boguslaw Stec3 The University of Texas at El Paso 500 West University Ave. Add to Reading List Source URL: www.math.utep.edu Language: English - Date: 2008-01-16 14:45:52 Least squares Regression analysis Operations research Convex optimization Levenberg–Marquardt algorithm Non-linear least squares Nonlinear programming Global optimization Gauss–Newton algorithm Mathematical optimization Numerical analysis Statistics
794	Journal of Artificial Intelligence Research[removed]429 Submitted 6/06; published 3/07 Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems Add to Reading List Source URL: www.jair.org Language: English - Date: 2009-08-06 19:20:44 NP-complete problems Discrete geometry Operations research Combinatorial optimization Bin packing problem Generalized assignment problem Knapsack problem Packing problem Strongly NP-complete Theoretical computer science Computational complexity theory Mathematics
795	Inner Product Spaces for MinSum Coordination Mechanisms∗ Richard Cole † Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-01-31 17:29:48 Problem solving Mathematics Applied mathematics Job shop scheduling Scheduling Price of anarchy Nash equilibrium Preemption Optimization problem Game theory Operations research Mathematical optimization
796	F r o m Approximate to O p t i m a l Solutions: A Case Study of N u m b e r Partitioning Add to Reading List Source URL: ijcai.org Language: English - Date: 2008-09-30 05:19:33 NP-complete problems Mathematical optimization Operations research Dynamic programming Partition problem Search algorithms Subset sum problem Greedy algorithm Genetic algorithm Theoretical computer science Mathematics Applied mathematics
797	From: AAAI-98 Proceedings. Copyright © 1998, AAAI (www.aaai.org). All rights reserved. Fast Probabilistic Modeling for Combinatorial Optimization Shumeet Baluja [removed] Justsystem Pittsburgh Research Center & Add to Reading List Source URL: www.aaai.org Language: English - Date: 2006-01-10 20:38:39 Operations research Population-based incremental learning Mathematical optimization Cybernetics Graphical models Artificial neural network Algorithm Genetic algorithm Travelling salesman problem Mathematics Applied mathematics Theoretical computer science
798	The Capacity-C Torch Problem Roland Backhouse [removed] School of Computer Science University of Nottingham, Nottingham NG8 1BB, England Add to Reading List Source URL: www.cs.nott.ac.uk Language: English - Date: 2013-02-14 12:32:30 Mathematical optimization Operations research Optimal control Systems engineering Summation Systems theory Systems science Mathematics Equations Dynamic programming
799	An Adaptive Scheme to Generate the Pareto Front Based on the Epsilon-Constraint Method Marco Laumanns1 , Lothar Thiele2 , and Eckart Zitzler2 1 2 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2005-11-10 09:29:38 Multi-objective optimization Pareto efficiency Linear programming Optimization problem Multidisciplinary design optimization Evolutionary multi-modal optimization Mathematical optimization Applied mathematics Mathematics
800	An Hierarchical Terrain Representation for Approximately Shortest Paths David Mould and Michael C. Horsch Department of Computer Science, University of Saskatchewan, Saskatoon, SK, Canada S7N 5A9 Add to Reading List Source URL: people.scs.carleton.ca Language: English - Date: 2008-08-15 17:38:04 Search algorithms Routing algorithms Game artificial intelligence Network theory Combinatorial optimization Shortest path problem Breadth-first search A* search algorithm Pathfinding Mathematics Theoretical computer science Graph theory

UPDATE